Characterizing Robust Solution Sets of Convex Programs under Data Uncertainty

نویسندگان

  • Vaithilingam Jeyakumar
  • G. M. Lee
  • Guoyin Li
چکیده

This paper deals with convex optimization problems in the face of data uncertainty within the framework of robust optimization. It provides various properties and characterizations of the set of all robust optimal solutions of the problems. In particular, it provides generalizations of the constant subdifferential property as well as the constant Lagrangian property for solution sets of convex programming to robust solution sets of uncertain convex programs. The paper shows also that the robust solution sets of uncertain convex quadratic programs and sum-of-squares convex polynomial programs under some commonly used uncertainty sets of robust optimization can be expressed as conic representable sets. As applications, it derives robust optimal solution set characterizations for uncertain fractional programs. The paper presents several numerical examples illustrating the results.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Robust SOS-Convex Polynomial Programs: Exact SDP Relaxations

This paper studies robust solutions and semidefinite linear programming (SDP) relaxations of a class of convex polynomial optimization problems in the face of data uncertainty. The class of convex optimization problems, called robust SOS-convex polynomial optimization problems, includes robust quadratically constrained convex optimization problems and robust separable convex polynomial optimiza...

متن کامل

Primal and dual robust counterparts of uncertain linear programs: an application to portfolio selection

This paper proposes a family of robust counterpart for uncertain linear programs (LP) which is obtained for a general definition of the uncertainty region. The relationship between uncertainty sets using norm bod-ies and their corresponding robust counterparts defined by dual norms is presented. Those properties lead us to characterize primal and dual robust counterparts. The researchers show t...

متن کامل

Some Robust Convex Programs without a Duality Gap∗

In this paper, we examine the duality gap between the robust counterpart of a primal uncertain convex optimization problem and the optimistic counterpart of its uncertain Lagrangian dual and identify the classes of uncertain problems which do not have a duality gap. The absence of a duality gap (or equivalently zero duality gap) means that the primal worst value equals the dual best value. We f...

متن کامل

Stock Evaluation under Mixed Uncertainties Using Robust DEA Model

Data Envelopment Analysis (DEA) is one of the popular and applicable techniques for assessing and ranking the stocks or other financial assets. It should be noted that in the financial markets, most of the times, the inputs and outputs of DEA models are accompanied by uncertainty. Accordingly, in this paper, a novel Robust Data Envelopment Analysis (RDEA) model, which is capable to be used in t...

متن کامل

A New Class of Alternative Theorems for SOS-Convex Inequalities and Robust Optimization∗

In this paper we present a new class of theorems of the alternative for SOS-convex inequality systems without any qualifications. This class of theorems provides an alternative equations in terms of sums of squares to the solvability of the given inequality system. A strong separation theorem for convex sets, described by convex polynomial inequalities, plays a key role in establishing the clas...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Optimization Theory and Applications

دوره 164  شماره 

صفحات  -

تاریخ انتشار 2015